Triangulation of Cross-sectional Digital Straight Segments and Minimum Length Polygons for Surface Area Estimation
نویسندگان
چکیده
This paper proposes a new heuristic locally determined algorithm for the triangulation between points sequences representing serial sections of a surface. Moreover, a strategy for surface area estimation based on triangulation of cross sectional contours is described, where each contour is represented by its sequence of vertices of maximal digital straight segments (DSS), or by its minimal length polygon (MLP). The application of the strategy, using the new triangulation algorithm, is illustrated by examples.
منابع مشابه
A new algorithm for triangulation from cross sections and its application to surface area estimation
This article proposes a new heuristic (locally determined) algorithm for the triangulation between point sequences representing cross-sectional contours of a surface. Such point sequence is required to be the set of vertices of a polygon representing a Jordan curve and approximating the contour. The algorithm which is applied directly to the whole point sequence, is very simple since it is base...
متن کاملOn the Length Estimation of Digital Curves
The paper details two linear-time algorithms, one for the partition of the boundary line of a digital region into digital straight segments, and one for calculating the minimum length polygon within a simple open boundary of a digital region. Both techniques allow the estimation of the length of digital curves or the perimeter of digital regions due to known multigrid convergence theorems. The ...
متن کاملExtraction of Optimal Skeleton of Polygon Based on Hierarchical Analysis
Skeleton is an important 1-D descriptor of polygon and a useful tool for advanced geometric algorithms. However the skeleton that most existing algorithms investigated is the longest one, which is not intended in all circumstances. This paper proposes an algorithm for extracting hierarchically optimal skeleton network of polygons. The algorithm incorporates length, angularity and area of associ...
متن کاملConverting triangulations to quadrangulations
We study the problem of converting triangulated domains to quadrangulations, under a variety of constraints. We obtain a variety of characterizations for when a triangulation (of some structure such as a polygon, set of points, line segments or planar subdivision) admits a quadrangulation without the use of Steiner points, or with a bounded number of Steiner points. We also investigate the effe...
متن کامل3d Building Reconstruction from Point Primitives: a Geometric Graph Approach
Building reconstruction is one of the most difficult and important 3D modelling problems for urban environment. In this paper, we develop an approach using minimum number of basic geometric elements to reconstruct the buildings. The basic element is a number of unstructured 3D points representing the topological identity of a building roof. Such point primitives can be measured by human or comp...
متن کامل